# regular

101

**regular as clockwork**— Always happening at the same time • • • Main Entry: ↑clock …102

**Regular expression**— In computing, a regular expression provides a concise and flexible means for matching (specifying and recognizing) strings of text, such as particular characters, words, or patterns of characters. Abbreviations for regular expression include… …103

**Regular polytope**— In mathematics, a regular polytope is a polytope whose symmetry is transitive on its flags, thus giving it the highest degree of symmetry. All its elements or j faces (for all 0≤ j ≤ n , where n is the dimension of the polytope) cells, faces and… …104

**Regular language**— In theoretical computer science, a regular language is a formal language (i.e., a possibly infinite set of finite sequences of symbols from a finite alphabet) that satisfies the following equivalent properties: * it can be accepted by a… …105

**Regular space**— In topology and related fields of mathematics, regular spaces and T3 spaces are particularly convenient kinds of topological spaces.Both conditions are examples of separation axioms. Definitions Suppose that X is a topological space. X is a… …106

**Regular polyhedron**— A regular polyhedron is a polyhedron whose faces are congruent (all alike) regular polygons which are assembled in the same way around each vertex. A regular polyhedron is highly symmetrical, being all of edge transitive, vertex transitive and… …107

**Regular polygon**— A regular polygon is a polygon which is equiangular (all angles are congruent) and equilateral (all sides have the same length). Regular polygons may be convex or star.General propertiesThese properties apply to both convex and star regular… …108

**Regular number**— The numbers that evenly divide the powers of 60 arise in several areas of mathematics and its applications, and have different names coming from these different areas of study. As an example, 602 = 3600 = 48 times; 75, so both 48 and 75 are… …109

**Regular grammar**— Strictly regular grammars = In computer science, a right regular grammar (also called right linear grammar) is a formal grammar ( N , Σ, P , S ) such that all the production rules in P are of one of the following forms: # A → a where A is a non… …110

**Regular category**— In category theory, a regular category is a category with finite limits and coequalizers of kernel pairs, satisfying certain exactness conditions. In that way, regular categories recapture many properties of abelian categories, like the existence …